A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree
نویسندگان
چکیده
منابع مشابه
Computing the Minimum Recombinant Haplotype Configuration from Incomplete Genotype Data on a Pedigree by Integer Linear Programming
We study the problem of reconstructing haplotype configurations from genotypes on pedigree data with missing alleles under the Mendelian law of inheritance and the minimum-recombination principle, which is important for the construction of haplotype maps and genetic linkage/association analyses. Our previous results show that the problem of finding a minimum-recombinant haplotype configuration ...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولMinimum Recombinant Haplotype Configuration on Tree Pedigrees (Extended Abstract)
We study the problem of reconstructing haplotype configurations from genotypes on pedigree data under the Mendelian law of inheritance and the minimum recombination principle, which is very important for the construction of haplotype maps and genetic linkage/association analysis. Li and Jiang [9, 10] recently proved that the Minimum Recombinant Haplotype Configuration (MRHC) problem is NP-hard,...
متن کاملA Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees
Abstract An O(nmα(m)) time algorithm is given for inferring haplotypes from genotypes of non-recombinant pedigree data, where n is the number of members, m is the number of sites, and α(m) is the inverse of the Ackermann function. The algorithm works on both tree and general pedigree structures with cycles. Constraints between pairs of heterozygous sites are used to resolve unreso...
متن کاملA Realization Algorithm for Discrete-Time Linear Systems with a non-zero initial state
s Almost-linear systems being introduced, the facts about the systems were cleared, and it was shown that the almost-linear systems contain linear systems with a non-zero initial state as a sub-class [1]. In this paper, based on the these results of almostlinear systems[1], we will discuss the real-time realization problem of linear systems with a non-zero initial state, namely, we will treat t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2012
ISSN: 1471-2105
DOI: 10.1186/1471-2105-13-s17-s19